On the single machine total tardiness problemTIAN, Z. J; NG, C. T; CHENG, T. C. E et al.European journal of operational research. 2005, Vol 165, Num 3, pp 843-846, issn 0377-2217, 4 p.Article

Complexity of two dual criteria scheduling problemsYUMEI HUO; LEUNG, J. Y.-T; HAIRONG ZHAO et al.Operations research letters. 2007, Vol 35, Num 2, pp 211-220, issn 0167-6377, 10 p.Article

Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruptionJINJIANG YUAN; YUNDONG MU.European journal of operational research. 2007, Vol 182, Num 2, pp 936-944, issn 0377-2217, 9 p.Article

Two due date assignment problems in scheduling a single machineSHABTAY, Dvir; STEINER, George.Operations research letters. 2006, Vol 34, Num 6, pp 683-691, issn 0167-6377, 9 p.Article

Improving the preemptive bound for the single machine dynamic maximum lateness problemDELLA CROCE, F; T'KINDT, V.Operations research letters. 2010, Vol 38, Num 6, pp 589-591, issn 0167-6377, 3 p.Article

Meta-heuristics for stable scheduling on a single machineBALLESTIN, Francisco; LEUS, Roel.Computers & operations research. 2008, Vol 35, Num 7, pp 2175-2192, issn 0305-0548, 18 p.Article

Note on scheduling with general learning curves to minimize the number of tardy jobsMOSHEIOV, G; SIDNEY, J. B.The Journal of the Operational Research Society. 2005, Vol 56, Num 1, pp 110-112, issn 0160-5682, 3 p.Article

Minimizing the number of late jobs when the start time of the machine is variableHOOGEVEEN, Han; T'KINDT, Vincent.Operations research letters. 2012, Vol 40, Num 5, pp 353-355, issn 0167-6377, 3 p.Article

Single machine scheduling with maximum earliness and number tardyAZIZOGLU, Meral; KONDAKCI, Suna; KÖKSALAN, Murat et al.Computers & industrial engineering. 2003, Vol 45, Num 2, pp 257-268, issn 0360-8352, 12 p.Article

Single-machine scheduling with general sum-of-processing-time-based and position-based learning effectsLAI, Peng-Jen; LEE, Wen-Chiung.Omega (Oxford). 2011, Vol 39, Num 5, pp 467-471, issn 0305-0483, 5 p.Article

Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardinessZHONGJUN TIAN; NG, C. T; CHENG, T. C. E et al.Operations research letters. 2009, Vol 37, Num 5, pp 368-374, issn 0167-6377, 7 p.Article

Single-machine group scheduling problems with deterioration considerationWU, Chin-Chia; SHIAU, Yau-Ren; LEE, Wen-Chiung et al.Computers & operations research. 2008, Vol 35, Num 5, pp 1652-1659, issn 0305-0548, 8 p.Article

Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteriaJINJIANG YUAN; YIXUN LIN.European journal of operational research. 2005, Vol 164, Num 3, pp 851-855, issn 0377-2217, 5 p.Conference Paper

On decomposition of the total tardiness problemCHANG, S; LU, Q; TANG, G et al.Operations research letters. 1995, Vol 17, Num 5, pp 221-229, issn 0167-6377Article

Minimizing the total completion time on-line on a single machine, using restartsVAN STEE, Rob; LA PCUTRE, Han.Journal of algorithms (Print). 2005, Vol 57, Num 2, pp 95-129, issn 0196-6774, 35 p.Article

Scheduling chains on a single machine with non-negative time lagsMUNIER, Alix; SOURD, Francis.Mathematical methods of operations research (Heidelberg). 2003, Vol 57, Num 1, pp 111-123, issn 1432-2994, 13 p.Article

Single-machine scheduling with flexible and periodic maintenanceCHEN, J. S.The Journal of the Operational Research Society. 2006, Vol 57, Num 6, pp 703-710, issn 0160-5682, 8 p.Article

Due-date assignment and single machine scheduling with deteriorating jobsCHENG, T. C. E; KANG, L; NG, C. T et al.The Journal of the Operational Research Society. 2004, Vol 55, Num 2, pp 198-203, issn 0160-5682, 6 p.Article

A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effectsKUO, W.-H; YANG, D.-L.The Journal of the Operational Research Society. 2011, Vol 62, Num 1, pp 206-210, issn 0160-5682, 5 p.Article

New constructive heuristics for the total weighted tardiness problemYOON, S. H; LEE, I. S.The Journal of the Operational Research Society. 2011, Vol 62, Num 1, pp 232-237, issn 0160-5682, 6 p.Article

Single-machine scheduling with learning considerationsBISKUP, D.European journal of operational research. 1999, Vol 115, Num 1, pp 173-178, issn 0377-2217Article

An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due dateVENTURA, J. A; WENG, M. X.Operations research letters. 1995, Vol 17, Num 3, pp 149-152, issn 0167-6377Article

Single machine scheduling and selection to minimize total flow time with minimum number tardyKYPARISIS, J; DOULIGERIS, C.The Journal of the Operational Research Society. 1993, Vol 44, Num 8, pp 835-838, issn 0160-5682Article

Batch scheduling with controllable setup and processing times to minimize total completion timeDANIEL NG, C. T; CHENG, T. C. E; KOVALYOV, M. Y et al.The Journal of the Operational Research Society. 2003, Vol 54, Num 5, pp 499-506, issn 0160-5682, 8 p.Article

Single-machine makespan minimization scheduling with nonlinear shortening processing timesWANG, Ming-Zheng; WANG, Ji-Bo.Computers & operations research. 2012, Vol 39, Num 3, pp 659-663, issn 0305-0548, 5 p.Article